Uniform Linear Bound in Chevalley's Lemma
نویسندگان
چکیده
منابع مشابه
On uniform weak König's lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2-conservative over primitive recursive arithmetic PRA (and even weaker fragments of ari...
متن کاملA bound for Dickson's lemma
We consider a special case of Dickson’s lemma: for any two functions f, g on the natural numbers there are two numbers i < j such that both f and g weakly increase on them, i.e., fi ≤ fj and gi ≤ gj . By a combinatorial argument (due to the first author) a simple bound for such i, j is constructed. The combinatorics is based on the finite pigeon hole principle and results in a descent lemma. Fr...
متن کاملOn the upper bound in Varadhan’s Lemma
In this paper, we generalize the upper bound in Varadhan’s Lemma. The standard formulation of Varadhan’s Lemma contains two important elements, namely an upper semicontinuous integrand and a rate function with compact sublevel sets. However, motivated by results from queueing theory, in this paper we do not assume that rate functions have compact sublevel sets. Moreover, we drop the assumption ...
متن کاملRegularity Lemma for k-uniform hypergraphs
Szemerédi’s Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms 2 (1991), 241–252], Frankl and Rödl [The uniformity lemma for hypergraphs, Graphs and Combinatorics 8 (1992), 309–312, Extremal problems on set systems, Random Structures and A...
متن کاملOn the Uniform Weak König’s Lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2conservative over primitive recursive arithmetic PRA (and even weaker fragments of arit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2008
ISSN: 1496-4279,0008-414X
DOI: 10.4153/cjm-2009-032-5